A polynomial-time reduction from the multi-graph isomorphism problem to additive code equivalence
نویسندگان
چکیده
We present a polynomial time reduction from the multi-graph isomorphism problem to of code equivalence additive codes over finite extensions ${\mathbb F}_2$.
منابع مشابه
A Polynomial Time Algorithm for Graph Isomorphism
Algorithms testing two graphs for isomorphism known as yet in computer science have exponential worst case complexity. In this paper we propose an algorithm that has polynomial complexity and constructively supplies the evidence that the graph isomorphism lies in P.
متن کاملA Time Dependent Pollution Routing Problem in Multi-graph
This paper considers a time dependent(the travel time is not constant throughout the day) pollution routing problem (TDPRP), which aids the decision makers in minimizing travel time, toll cost and emitted pollution cost. In complexity of urban areas most of the time one point is accessible from another with more than one edge. In contrast to previous TDPRP models, which are designed with only ...
متن کاملIsomorphism Testing via Polynomial-Time Graph Extensions
This paper deals with algorithms for detecting graph isomorphism (GI) properties. The GI literature consists of numerous research directions, from highly theoretical studies (e.g. defining the GI complexity class) to very practical applications (pattern recognition, image processing). We first present the context of our work and provide a brief overview of various algorithms developed in such d...
متن کاملPolynomial Time Algorithm for Graph Isomorphism Testing
Earlier we introduced (M.I.Trofimov, E.A.Smolenskii, Application of the Electronegativity Indices of Organic Molecules to Tasks of Chemical Informatics, Russian Chemical Bulletin 54(2005), 2235-2246. http://dx.doi.org/10.1007/s11172-006-0105-6) effective recursive algorithm for graph isomorphism testing. In this paper we describe used approach and iterative modification of this algorithm, which...
متن کاملTrivalent Graph isomorphism in polynomial time
4 Implementation test 35 Sumario 41 Bibliography 47 3 Preamble The graph isomorphism problem has a long history in mathematics and computer science, and more recently in fields of chemistry and biology. Graph theory is a branch of mathematics started by Euler as early as 1736 with his paper The seven bridges of Könisberg. It took a hundred years before other important contribution of Kirchhoff ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete mathematics letters
سال: 2021
ISSN: ['2664-2557']
DOI: https://doi.org/10.47443/dml.2021.0097